/*
Copyright 2017 Google Inc. All Rights Reserved.

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS-IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/

#ifndef VR_SEURAT_ARTIFACT_SORT_ATLAS_TILES_TRANSFORM_H_
#define VR_SEURAT_ARTIFACT_SORT_ATLAS_TILES_TRANSFORM_H_

#include <memory>

#include "seurat/artifact/artifact.h"
#include "seurat/artifact/artifact_processor.h"

namespace seurat {
namespace artifact {

// Orders the texture tiles in the input quad mesh by their size, smallest to
// largest, but without changing the draw order of the quads defining the mesh.
// Breaks ties of tiles with the same width by their height, effectively
// lexicographically. This organizes the texture data to simplify further
// processing, i.e. to assume tiles are organized into sets of contiguous blocks
// of identical size.
//
// The input Artifact.quad_mesh is replaced.  All other elements are unmodified.
class SortAtlasTilesTransform : public ArtifactProcessor {
 public:
  ~SortAtlasTilesTransform() override = default;

  base::Status Process(Artifact* artifact) const override;
};

}  // namespace artifact
}  // namespace seurat

#endif  // VR_SEURAT_ARTIFACT_SORT_ATLAS_TILES_TRANSFORM_H_
